An efficient parallel termination detection algorithm

An efficient parallel termination detection algorithm

In this paper, we present a new, easy to implement algorithm for detecting the termination of a parallel asynchronous computation on distributedmemory MIMD computers. We demonstrate that it operates concurrently with the main computation, adding minimal overhead, and we prove that it correctly detects termination when it occurs. Experimental results confirm that the termination detection routin...

An efficient delay-optimal distributed termination detection algorithm

Distributed termination detection is a fundamental problem in parallel and distributed computing and numerous schemes with different performance characteristics have been proposed. These schemes, while being efficient with regard to one performance metric, prove to be inefficient in terms of other metrics. A significant drawback shared by all previous methods is that, on most popular topologies...

An Efficient Parallel Anomaly Detection Algorithm Based on Hierarchical Clustering

For the purpose of improving real time and profiles accuracy, a parallel anomaly detection algorithm based on hierarchical clustering has been proposed. Training and predicting are two busiest processes and they are parallel designed and implemented. Moreover, an abnormal cluster feature tree is built to dig anomalies from normal profiles. A series of experiment results on wellknown KDD Cup 199...

An Optimal Termination Detection Algorithm for Rings

Rings Murat Demirbas Anish Arora 1 Department of Computer and Information S ien e The Ohio State University Columbus, Ohio 43210 USA Abstra t This paper presents an optimal termination dete tion algorithm for rings. The algorithm is based on Safra's and Dijkstra et al.'s [1℄ algorithm. It optimizes the time onstant of the Dijkstra & Safra algorithm from 2N 3N to 0 N , where N denotes the number...

An Efficient Parallel Biconnectivity Algorithm